# -*- coding: utf-8 -*-
'''
验证哥德巴赫猜想
'''
def isPrime( num ):
  #判断是否是质数
  from math import sqrt
  if num == 0 or num == 1:
      flag = False
  elif num == 2:
      flag = True

  else:
      for i in range(2, num):
          if num % i == 0:
              flag = False
              break
          else:
              flag = True
  return flag

n = int(input())
for i in range(1, n):
  j = n-i
  if isPrime(i) and isPrime(j):
    print('{0} = {1} + {2}'.format(n, i, j))
    break